Time/Space Trade-offs in Route Server Implementation

Internet transmission and switching facilities are partitioned into different administrative domains. To effect data exchange between domains, domain border routers usually establish pairwise peering sessions and exchange routes at exchange points. At some exchangepoints, border routers peer with a Route Server instead. The Route Server computes a set of routes on behalf of each of its client border routers. A Route Server implementation that maintains a separate table of routes for each client can be memory intensive; the worst-case route storage requirement of such an implementation is more than 650 MB in some configurations. We describe optimizations that trade-off Route Server route processing for an order of magnitude reduction in route storage requirements.